In mathematics, mollifiers (also known as approximations to the identity) are particular , used for example in distribution theory to create of smooth functions approximating nonsmooth (generalized) functions, via convolution. Intuitively, given a (generalized) function, convolving it with a mollifier "mollifies" it, that is, its sharp features are smoothed, while still remaining close to the original.[That is, the mollified function is close to the original with respect to the topology of the given space of generalized functions.]
They are also known as Friedrichs mollifiers after Kurt Otto Friedrichs, who introduced them.[See .]
Historical notes
Mollifiers were introduced by Kurt Otto Friedrichs in his paper , which is considered a watershed in the modern theory of partial differential equations.
[See the commentary of Peter Lax on the paper in .] The name of this mathematical object has a curious genesis, and
Peter Lax tells the story in his commentary on that paper published in Friedrichs' "
Selecta".
According to him, at that time, the mathematician Donald Alexander Flanders was a colleague of Friedrichs; since he liked to consult colleagues about English usage, he asked Flanders for advice on naming the smoothing operator he was using.
Flanders was a modern-day
puritan, nicknamed by his friends Moll after
Moll Flanders in recognition of his moral qualities: he suggested calling the new mathematical concept a "
mollifier" as a pun incorporating both Flanders' nickname and the verb
, meaning 'to smooth over' in a figurative sense.[In Lax writes "]On English usage Friedrichs liked to consult his friend and colleague, Donald Flanders, a descendant of puritans and a puritan himself, with the highest standard of his own conduct, noncensorious towards others. In recognition of his moral qualities he was called Moll by his friends. When asked by Friedrichs what to name the smoothing operator, Flanders remarked that they could be named "mollifier" after himself; Friedrichs was delighted, as on other occasions, to carry this joke into print.''"
Previously, Sergei Sobolev had used mollifiers in his epoch making 1938 paper,[See .] which contains the proof of the Sobolev embedding theorem: Friedrichs himself acknowledged Sobolev's work on mollifiers, stating " These mollifiers were introduced by Sobolev and the author...".[.]
It must be pointed out that the term "mollifier" has undergone linguistic drift since the time of these foundational works: Friedrichs defined as " mollifier" the integral operator whose kernel is one of the functions nowadays called mollifiers. However, since the properties of a linear integral operator are completely determined by its kernel, the name mollifier was inherited by the kernel itself as a result of common usage.
Definition
Modern (distribution based) definition
Let be a [[smooth function]] on , , and put for .
Then
is a
mollifier if it satisfies the following three requirements:
- it is compactly supported,
[This is satisfied if, for instance, is a bump function.]
- ,
- ,
where is the Dirac delta function, and the limit must be understood as taking place in the space of Schwartz distributions. The function may also satisfy further conditions of interest;[See .] for example, if it satisfies
- for all ,
then it is called a positive mollifier, and if it satisfies
- for some infinitely differentiable function ,
then it is called a symmetric mollifier.
Notes on Friedrichs' definition
Note 1. When the theory of distributions was still not widely known nor used,
[As when the paper was published, few years before Laurent Schwartz widespread his work.] property above was formulated by saying that the
convolution of the function
with a given function belonging to a proper
Hilbert space or
Banach space converges as
ε → 0 to that function:
[Obviously the topology with respect to convergence occurs is the one of the Hilbert space or Banach space considered.] this is exactly what Friedrichs did.
[See , properties PI, PII, PIII and their consequence PIII0.] This also clarifies why mollifiers are related to approximate identities.
[Also, in this respect, says:-" The main tool for the proof is a certain class of smoothing operators approximating unity, the "mollifiers".]
Note 2. As briefly pointed out in the "Historical notes" section of this entry, originally, the term "mollifier" identified the following Convolution:[See , paragraph 2, " Integral operators".]
where and is a smooth function satisfying the first three conditions stated above and one or more supplementary conditions as positivity and symmetry.
Concrete example
Consider the
bump function of a variable in
defined by
0& \text{ if } |x|\geq 1
\end{cases}
where the numerical constant ensures normalization. This function is infinitely differentiable, non analytic with vanishing derivative for . can be therefore used as mollifier as described above: one can see that defines a positive and symmetric mollifier.[See , lemma 1.2.3.: the example is stated in implicit form by first defining
]
- for ,
and then considering
- for .
Properties
All properties of a mollifier are related to its behaviour under the operation of
convolution: we list the following ones, whose proofs can be found in every text on distribution theory.
[See for example .]
Smoothing property
For any distribution
, the following family of convolutions indexed by the
real number
where denotes convolution, is a family of .
Approximation of identity
For any distribution
, the following family of convolutions indexed by the
real number converges to
Support of convolution
For any distribution
,
- ,
where indicates the support in the sense of distributions, and indicates their Minkowski addition.
Applications
The basic application of mollifiers is to prove that properties valid for
are also valid in nonsmooth situations.
Product of distributions
In some theories of generalized functions, mollifiers are used to define the multiplication of distributions. Given two distributions
and
, the limit of the product of the
smooth function obtained from one operand via mollification, with the other operand defines, when it exists, their product in various theories of generalized functions:
- .
"Weak=Strong" theorems
Mollifiers are used to prove the identity of two different kind of extension of differential operators: the strong extension and the
Weak formulation. The paper by Friedrichs which introduces mollifiers illustrates this approach.
Smooth cutoff functions
By convolution of the characteristic function of the
unit ball with the
smooth function (defined as in with
), one obtains the function
\begin{align}
\chi_{B_1,1/2}(x)
&=\chi_{B_1}\ast\varphi_{1/2}(x)
\\
&=\int_{\mathbb{R}^n}\!\!\!\chi_{B_1}(x-y)\varphi_{1/2}(y)\mathrm{d}y
\\
&=\int_{B_{1/2}}\!\!\!
\chi_{B_1}(x-y) \varphi_{1/2}(y)\mathrm{d}y \ \ \ (\because\ \mathrm{supp}(\varphi_{1/2})=B_{1/2})
\end{align}
which is a smooth function equal to on , with support contained in . This can be seen easily by observing that if and then . Hence for ,
\int_{B_{1/2}}\!\!\!\chi_{B_1}(x-y) \varphi_{1/2}(y)\mathrm{d}y= \int_{B_{1/2}}\!\!\!
\varphi_{1/2}(y)\mathrm{d}y=1
.
One can see how this construction can be generalized to obtain a smooth function identical to one on a neighbourhood of a given
compact set, and equal to zero in every point whose
distance from this set is greater than a given
.
[A proof of this fact can be found in , Theorem 1.4.1.] Such a function is called a (smooth)
cutoff function; these are used to eliminate singularities of a given (generalized) function via
multiplication. They leave unchanged the value of the multiplicand on a given set, but modify its support. Cutoff functions are used to construct smooth partitions of unity.
See also
Notes
-
. The first paper where mollifiers were introduced.
-
. A paper where the differentiability of solutions of elliptic partial differential equations is investigated by using mollifiers.
-
. A selection from Friedrichs' works with a biography and commentaries of David Isaacson, Fritz John, Tosio Kato, Peter Lax, Louis Nirenberg, Wolfgag Wasow, Harold Weitzner.
-
.
-
.
-
. The paper where Sergei Sobolev proved his embedding theorem, introducing and using integral operators very similar to mollifiers, without naming them.